Optimizing supervised generative adversarial networks via latent space regularizations

ABSTRACT

A method of training a generator G of a Generative Adversarial Network (GAN) includes receiving, by an encoder E, a target data Y; receiving, by the encoder E, an output G(Z) of the generator G, where the generator G generates the output G(Z) in response to receiving a random sample Z and where a discriminator D of the GAN is trained to distinguish which of the G(Z) and the target data Y; training the encoder E to minimize a difference between a first latent space representation E(G(Z)) of the output G(Z) and a second latent space representation E(Y) of the target data Y, where the output G(Z) and the target data Y are input to the encoder E; and using the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G.

CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a continuation of U.S. patent application Ser. No. 16/530,692, filed Aug. 2, 2019, which claims priority to and the benefit of U.S. Provisional Patent Application No. 62/840,635, filed Apr. 30, 2019, the entire disclosures of both of which are hereby incorporated by reference.

TECHNICAL FIELD

This disclosure relates generally to generative adversarial networks (GANs) and more specifically to the training of a GAN.

BACKGROUND

Machine learning relates to computers learning to perform tasks without explicit instructions. Based on sample data, a computer builds (e.g., infers) a model for performing a task. When presented with new data, the computer uses the model to perform the task. The task can be a classification task, a prediction task, an inference task, and the like.

Generative adversarial networks (GANs) are a class of machine learning systems that can be used to generate new data. For example, GANs can be used to generate new images. For example, in the field of super-resolution, GANs can be used to generate high-resolution images from low-resolution images. For example, in the field of inpainting, GANs can be used to reconstruct lost or deteriorated parts of images and/or videos. GANs can also be used in many other applications, such as for generating realistic domain-specific images (i.e., generating images that look real).

SUMMARY

A first aspect is a method of training a generator G of a Generative Adversarial Network (GAN). The method includes receiving, by an encoder E, a target data Y; receiving, by the encoder E, an output G(Z) of the generator G, where the generator G generates the output G(Z) in response to receiving a random sample Z, and where a discriminator D of the GAN is trained to distinguish which of the G(Z) and the target data Y; training the encoder E to minimize a difference between a first latent space representation E(G(Z)) of the output G(Z) and a second latent space representation E(Y) of the target data Y, where the output G(Z) and the target data Y are input to the encoder E; and using the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G.

A second aspect is an apparatus for training a generator G of a Generative Adversarial Network (GAN). The apparatus includes a memory and a processor. The processor is configured to execute instructions stored in the memory to input, to an encoder E, a target data Y; input, to the encoder E, an output G(Z) of the generator G, where the generator G generates the output G(Z) in response to receiving a random sample Z, and where a discriminator D of the GAN is trained to distinguish which of the G(Z) and the target data Y; train the encoder E to minimize a difference between a first latent space representation E(G(Z)) of the output G(Z) and a second latent space representation E(Y) of the target data Y, where the output G(Z) and the target data Y are input to the encoder E; and use the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G.

A third aspect is an apparatus for generating a super resolution image. The apparatus can include a memory and a processor that can implement a method. The method implemented by the apparatus includes receiving, by a generator G, an input corresponding to a low resolution image; and outputting, from the generator G, a super resolution image corresponding to the low resolution image, wherein the generator is trained using a Generative Adversarial Network (GAN). The GAN includes the generator G, an encoder E, and a discriminator D. Outputs of the encoder E are used to constrain the training of the generator G.

BRIEF DESCRIPTION OF THE DRAWINGS

The disclosure is best understood from the following detailed description when read in conjunction with the accompanying drawings. It is emphasized that, according to common practice, the various features of the drawings are not to-scale. On the contrary, the dimensions of the various features are arbitrarily expanded or reduced for clarity.

FIG. 1 is an example of a generic generative adversarial network (GAN).

FIG. 2 is a block diagram of an example of a computing device that can implement a neural network.

FIG. 3 is an example of a problem with generated data by a GAN.

FIG. 4 is an illustration of an image manifold and a latent space of the image manifold.

FIG. 5 is an example of a GAN architecture 500 that includes an encoder according to implementations of this disclosure.

FIG. 6 is an example of a flowchart of a technique of training a Generative Adversarial Network (GAN) according to implementations of this disclosure.

DETAILED DESCRIPTION

Deep Neural Networks (DNN) have been utilized in many areas to, inter alia, solve computer vision problems such as image recognition and image generation. Convolutional Neural Networks (CNN), in particular, have been widely used and have achieved the state-of-the-art results in these areas.

Deep CNN models extract image features through operations such as filtering, striding, pooling and non-linear rectifying. The features become more abstract as the CNN layers get deeper. These features (referred to as latent space features) are fed to the final layers of the network to perform computer vision tasks such as object detection, image classification, image segmentation, image annotation and image generation. Many model architectures have been proposed to improve the performance such as accuracy.

Generative adversarial networks (GANs) can be used to learn the data distribution of, for example, real images. Based on the learning, new images can be generated. More specifically, a generator G of the GAN learns the distribution of real data on the underlying real data, and then attempts to generate samples that look like the real samples.

A problem with GAN networks is that generated data (e.g., generated images) may contain undesirable artefacts, such as distortions or unnatural image structures, such as described with respect to FIG. 3 . Implementations and GAN architectures according to this disclosure can be used to eliminate or at least reduce such artefacts. As such, more realistic and artefact-free data can be generated by the generator G.

Implementations and GAN architectures according to this disclosure leverage the Lipschitz continuity condition in the training of GAN architectures according to this disclosure. The Lipschitz continuity condition can be used to introduce an encoder E into a GAN architecture. The encoder E can be used to minimize the latent space differences between a generated sample, G(Z) and a target sample, Y, as further explained below. The latent spaces of G(Z) and Y are denoted, respectively, E(G(Z)) and E(Y). The disclosure herein mainly applies in supervised learning situations. In supervised learning, a real data sample, y_(i), that corresponds to a generated data G(z_(i)) is known. That is, the correspondence between a pair of real and generated data samples is known. Said another way, when a new data G(z_(i)) is generated, it is known what that G(z_(i)) should look like; namely, G(z_(i)) should look like a corresponding and known y_(i).

Supervised learning can be used, for example, in super resolution applications. Super resolution refers to, given a low resolution blurry picture, generating a high resolution and clear picture with enough detail and sharpness. For example, in visual communication, a sender may send to a receiver a relatively blurred, small picture over a network. Super resolution can be used by the receiver to enhance the picture details and the resolution. For example, If the receiver receives the picture in standard definition (SD), the receiver can restore the image to a high-definition (HD). For example, a picture that is captured using a digital camera with limited picture resolution can be enlarged by using super resolution.

Throughout, a generator may be referred as G, a generator, or a generator network; a discriminator, may be referred to as D, a discriminator, or a discriminator network; and an encoder may be referred as E, an encoder, or an encoder network.

Optimizing supervised generative adversarial networks via latent space regularizations is described herein first with reference to a system, architecture, or environment in which the teachings can be incorporated.

FIG. 1 is an example of a generic generative adversarial network (GAN) 100. The GAN 100 includes a generator 102 and a discriminator 104. A purpose of the GAN 100 is such that, through training (i.e., after the training is complete), the generator 102 can generate realistic data (e.g., generated, realistic images of faces) such that the discriminator 104 cannot tell that the data is generated. That is, the discriminator 104 considers (i.e., is fooled into considering) the generated data to be real data.

The generator 102 can be an inverse convolutional network that receives a vector of random noise, Z, and up-samples the noise, Z, to generate the generated data (e.g., generated image), G(Z). The generator 102 can be thought of as a function that maps the input Z to an output G(Z). The discriminator 104 can be a convolutional network that can categorize the input that is fed to it, along an input 106, into as either real or fake (i.e., generated).

In an example, given an input X, the discriminator 104 outputs a label, D(X), indicating whether the input X is real or generated. The discriminator 104 can be binomial classifier that can label (e.g., classify) an input X as real or generated. For example, D(X) can be 0 if the discriminator 104 determines that the input X is generated; otherwise D(X) can be 1. Other output values can be possible. In another example, D(X) can be a probability value.

As illustrated by a switch 108, the discriminator 104 can receive, as an input X, either the output G(Z) of the generator 102 or a real data sample Y. When the discriminator 104 receives G(Z) as input (i.e., when X=G(Z)), the output of the discriminator 104 is a value, D(G(Z)), indicating whether the discriminator 104 considers the input G(Z) to be real or generated. When the discriminator 104 receives Y as input (i.e., when X=Y), the output of the discriminator 104 is a value, D(Y), indicating whether the discriminator 104 considers the input Y to be real or generated.

The generator 102 and the discriminator 104 networks can be thought of as working together and, at the same time, working against each other. Colloquially, the generator 102 can be thought of a counterfeiter and the discriminator 104 can be thought of as a cop. The counterfeiter's purpose (during the training) is to generate data such that the cop cannot recognize that the generated data are counterfeit.

The generator 102 is trained to maximize the probability D(G(Z)) to fool the discriminator 104 so that the discriminator 104 is not able to tell G(Z) is generated. The discriminator 104 is trained to minimize the probability D(G(Z)) and maximize the probability D(Y) so that the generated sample G(Z) can be distinguished from a real data sample Y. When a real input Y is fed into the discriminator 104, the goal of the discriminator 104 is to output, for example, a probability D(X)=1; and to output a D(X)=0 if the input is generated (e.g., G(X)). Again, D(X) can be the probability that the input X is real (i.e., P(class of input=real data)).

The end result is that when both the generator 102 and the discriminator 104 converge, the discriminator 104 can no longer distinguish the generated sample G(Z) from a real data sample Y. At this point, the generator 102 can be regarded as having learned the distribution of the real data Y. By convergence is meant that additional training of either of the generator 102 and/or the discriminator 104 does lead to improved (or sufficiently improved) performance.

Backpropagation can be used to improve the performance of each of the generator 102 and the discriminator 104 networks.

As mentioned, the discriminator 104 can output a value D(x) indicating the chance that the input X is a real data sample. The objective of the discriminator 104 is to maximize the chance of recognizing real data samples (i.e., Y) as real and the chance of recognizing that generated samples (i.e., G(Z)) as fake (i.e., generated). That is, the goal of the discriminator 104 is to maximize the likelihood of the inputs. To measure the loss, cross-entropy, p log(q), can be used. Optimizing the weights θ_(D) of the discriminator 104 can be expressed by the optimization problem of equation (1):

$\begin{matrix} {\theta_{D}^{*} = {{\arg_{\theta_{D}}\max_{\theta_{D}}E{P_{y}\left\lbrack {\log{D_{\theta_{D}}(y)}} \right\rbrack}} + {E{P_{Z}\left\lbrack {\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}(z)} \right)}} \right)} \right\rbrack}}}} & (1) \end{matrix}$

In equation (1), EP_(y) means the expectation value with respect to the distribution of variable Y (i.e., a real data sample), EP_(z) means the expectation value with respect to the distribution of variable Z (i.e., the random noise from which G(Z) is generated), and θ_(D) and θ_(G) are the current network weight parameters of the discriminator 104 (D) and the generator 102 (G) respectively. D_(θ) _(D) (y) is the output of the discriminator 104 given the current discriminator network parameters θ_(D) when the input Y (i.e., a real data sample) is presented to the discriminator 104. D_(θ) _(D) (G_(θ) _(D) (z)) is the output of the discriminator 104 given the current discriminator network parameters θ_(D) when the input G_(θ) _(G) (z) (which, in turn, is the output of the generator 102 given the current generator network parameter θ_(G) when the input z is presented to the generator 102) is presented to the discriminator 104.

The equation (1) (i.e., the objective function of the discriminator 104) can be summarized as: find a new set of discriminator network parameters, θ_(D)*, that maximizes the ability of the discriminator 104 to recognize real data samples better (i.e., corresponding to the term EP_(y)[log D_(θ) _(D) (y)]) and to recognize generated data samples better (i.e., corresponding to the term EP_(z)[log (1−D_(θ) _(D) (G_(θ) _(G) (z)))]).

Training the generator 102 can also be via backpropagation. The objective function of the generator 102, as mentioned above, can be such that the generator 102 generates data (e.g., images) with the highest possible value of D(x) to fool the discriminator 104. As such, the objective function of the generator G can be given by equation (2):

$\begin{matrix} {\theta_{G}^{*} = {\arg_{\theta_{G}}\min_{\theta_{G}}E{P_{Z}\left\lbrack {\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}(z)} \right)}} \right)} \right.}}} & (2) \end{matrix}$

EP_(z) and D_(θ) _(D) (G_(θ) _(G) (z)) are as described with respect to equation (1). Equation (2) can be summarized as: Find the optimal parameters of the generator 102, G, so that an output G(Z) of the generator 102 can fool the discriminator 104 the most.

The equations (1) and (2) can be combined into the minmax optimization problem:

(θ_(G)^(*), θ_(D)^(*)) = arg_((θ_(G), θ_(D)))min_(θ_(G))max_(θ_(D))EP_(y)[log D_(θ_(D))(y)] + EP_(Z)[log (1 − D_(θ_(D))(G_(θ_(G))(z)))]

In an example, the objective functions of equations (1) and (2) can be learned jointly, such as by alternating gradient ascent and descent of the discriminator 104 and the generator 102, respectively. For example, the parameters, θ_(G), of the generator 102 can be fixed and a single iteration of gradient ascent on the discriminator 104 can be performed using the real (i.e., Y) and the generated (i.e., G_(θ) _(G) (z)) data samples; then the parameters, θ_(D), of the discriminator 104 are fixed and the generator 102 can be trained for another single iteration of gradient descent. The discriminator 104 and the generator 102 networks can be trained in alternating steps until the generator 102 produces samples, G(Z), that the discriminator 104 cannot recognize as generated samples.

FIG. 2 is a block diagram of an example of a computing device 200 that can implement a neural network. The neural network can be a convolutional neural network. For example, the computing device 200 can implement one or both of the generator 102 and the discriminator 104 of FIG. 1 . The computing device 200 can implement an encoder, E, as further described below. The computing device 200 can be in the form of a computing system including multiple computing devices, or in the form of a single computing device, for example, a mobile phone, a tablet computer, a laptop computer, a notebook computer, a desktop computer, and the like.

A CPU 202 in the computing device 200 can be a central processing unit. Alternatively, the CPU 202 can be any other type of device, or multiple devices, capable of manipulating or processing information now-existing or hereafter developed. Although the disclosed implementations can be practiced with a single processor as shown, e.g., the CPU 202, advantages in speed and efficiency can be achieved using more than one processor.

A memory 204 in the computing device 200 can be a read-only memory (ROM) device or a random access memory (RAM) device in an implementation. Any other suitable type of storage device can be used as the memory 204. The memory 204 can include code and data 206 that is accessed by the CPU 202 using a bus 212. The memory 204 can further include an operating system 208 and application programs 210, the application programs 210 including at least one program that permits the CPU 202 to perform the methods described here. For example, the application programs 210 can include applications 1 through N, which further include a video coding application that performs the methods described here. The computing device 200 can also include a secondary storage 214, which can, for example, be a memory card used with a computing device 200 that is mobile. Because the video communication sessions can contain a significant amount of information, they can be stored in whole or in part in the secondary storage 214 and loaded into the memory 204 as needed for processing.

The computing device 200 can also include one or more output devices, such as a display 218. The display 218 can be, in one example, a touch sensitive display that combines a display with a touch sensitive element that is operable to sense touch inputs. The display 218 can be coupled to the CPU 202 via the bus 212. Other output devices that permit a user to program or otherwise use the computing device 200 can be provided in addition to or as an alternative to the display 218. When the output device is or includes a display, the display can be implemented in various ways, including by a liquid crystal display (LCD), a cathode-ray tube (CRT) display or light emitting diode (LED) display, such as an organic LED (OLED) display.

The computing device 200 can also include or be in communication with an image-sensing device 220, for example a camera, or any other image-sensing device 220 now existing or hereafter developed that can sense an image such as the image of a user operating the computing device 200. The image-sensing device 220 can be positioned such that it is directed toward the user operating the computing device 200. In an example, the position and optical axis of the image-sensing device 220 can be configured such that the field of vision includes an area that is directly adjacent to the display 218 and from which the display 218 is visible.

The computing device 200 can also include or be in communication with a sound-sensing device 222, for example a microphone, or any other sound-sensing device now existing or hereafter developed that can sense sounds near the computing device 200. The sound-sensing device 222 can be positioned such that it is directed toward the user operating the computing device 200 and can be configured to receive sounds, for example, speech or other utterances, made by the user while the user operates the computing device 200.

Although FIG. 2 depicts the CPU 202 and the memory 204 of the computing device 200 as being integrated into a single unit, other configurations can be utilized. The operations of the CPU 202 can be distributed across multiple machines (each machine having one or more of processors) that can be coupled directly or across a local area or other network. The memory 204 can be distributed across multiple machines such as a network-based memory or memory in multiple machines performing the operations of the computing device 200. Although depicted here as a single bus, the bus 212 of the computing device 200 can be composed of multiple buses. Further, the secondary storage 214 can be directly coupled to the other components of the computing device 200 or can be accessed via a network and can comprise a single integrated unit such as a memory card or multiple units such as multiple memory cards. The computing device 200 can thus be implemented in a wide variety of configurations.

As already mentioned, GAN models have become popular for image processing tasks, such as super resolution, image to image translation, image or video style transfer, inpainting, and other applications. However, there are some inherent problems in GAN models. Examples of such problems include mode collapse and distortion. Mode collapse refers to situations where multiple inputs map to one output when the different inputs are expected/intended to result in different outputs. For example, given a bimodal distribution of data with 2 Gaussians concentrated at two points, the GAN may learn only one of the modes. As such, regardless of the input to the generator, the output would map to the one of the Gaussian distributions that is learnt.

For example, when a generator, such as the generator 102 of FIG. 1 , is applied to generate images that mimic natural images as in the computer vision task of single image super resolution, even with supervised training for the generator network, the generated image may look unreal, distorted, and/or lack details. FIG. 3 is an example of a problem 300 with generated data by a GAN.

An image 306 is a ground truth, high resolution image of a zebra. The image 306 includes a patch 307 showing clear structures. The patch 307 is shown in a zoomed patch 308. The zoomed patch 308 illustrates that stripes 309 are natural, clear, and undistorted. Contrastingly, an image 302 is a GAN-generated super resolved high resolution image of the image 306. A patch 303 of the image 302 corresponds to the patch 307 of the image 306. The patch 303 is shown in a zoomed patch 304. As can be seen, stripes 305, which correspond to the stripes 309, contain distorted internal structures. The zebra stripes in the zoomed patch 304 are not structured.

As such, it is desirable that data (e.g., images) generated by a generator of a GAN not include artefacts, such as distortions and/or unnatural structures. Generating images with less artefacts can improve the learning performance of the GAN. That is, the more realistic the generated data, the quicker the GAN can converge to optimal solutions to equations (1) and (2).

Natural images can be regarded as residing in a manifold embedded in a high dimensional space (also called the ambient space). FIG. 4 is an illustration 400 of an image manifold and a latent space of the image manifold. A manifold 402 is illustrated. The manifold 402 is usually of lower dimensionality than that of the ambient space. An ambient space 404 is illustrated, for ease of visualization, as a 3-dimensional space. In general, the ambient space 404 can be thought of as being m-dimensional. For ease of visualization, the manifold 402 is illustrated as being mapped to a two-dimensional latent space, a latent space 406. However, in general, the manifold 402 can be thought of as being n-dimensional, where n≤m.

The manifold 402 can be mapped, as illustrated by an arrow 408, to the lower dimensional space (i.e., the latent space 406) via an encoding map E (i.e., an encoder E). The lower dimensional space can be called the latent space. The reverse mapping, illustrated by an arrow 410, from the latent space 406 to the ambient space 404 is the generator function G. That is, a generator, such as the generator 102 of FIG. 1 , can generate a data sample in the ambient space 404. The two spaces (i.e., the ambient space 404 and the latent space 406) are homeomorphic, in mathematical terms. As such, the encoder E and the generator G are homeomorphisms. That is, the image manifold 402 can be homeomorphic between the generator and the encoder spaces. Under this homeomorphism, at least theoretically, the two spaces are equivalent. One space can be mapped to the other using the corresponding generator function or the encoding function.

Different classes of natural images reside in different neighborhoods of the manifold. It is desirable that each data sample (e.g., each image) that is generated (i.e., by a generator, such as the generator 102 of FIG. 1 ) be located in a close vicinity of the target neighborhood. That is, for example, it is desirable that the generated data sample G(Z) of FIG. 1 be as close as possible to the target Y of FIG. 1 .

To achieve this, implementations according to this disclosure can use a new GAN architecture that imposes regularizations from the latent space. An encoder E can be combined with a GAN, such as the GAN 100 of FIG. 1 . New loss functions are used to train GAN models according to this disclosure.

Latent space regularization is now explained. As explained with respect to FIG. 4 , a collection of, for example, N×M-sized natural images can reside in a manifold, such as the manifold 402, embedded in an N*M dimensional space, such as the ambient space 404. If the images in the collection are effectively parameterized by a small number of continuous variables, then the collection of images will lie on or near a low dimensional manifold in this high dimensional space.

As is known, before a neural network can be used for a task (e.g., classification, regression, image reconstruction, etc.), the neural network is trained to extract features through many layers (convolutional, recurrent, pooling, etc.). The neural network becomes (e.g., learns) a function that projects (e.g., maps) the image on the latent space. In other words, the latent space is the space where the features lie. The latent space contains a compressed representation of the image. This compressed representation is then used to reconstruct an input, as faithfully as possible. To perform well, a neural network has to learn to extract the most relevant features (e.g., the most relevant latent space).

Given any two samples z₁ and z₂ in the latent space (i.e., z₁ and z₂ used as inputs to a generator, such as the generator 102 of FIG. 1 ), the generated samples in the ambient space are G(z₁) and G(z₂) (i.e., G(z₁) and G(z₂) are the respective outputs of the generator). The inequality (3) can be imposed on the generator function. |G(z ₁)−G(z ₂)|≤k*|z ₁ −z ₂|  (3)

The inequality (3) expresses that the absolute change (i.e., |G(z₁)−G(z₂)|) of the function G (i.e., the output of a generator G) can be upper bounded by a constant multiple, k, of the absolute latent space difference (i.e., |z₁−z₂|). The constant, k, is referred to as the Lipschitz constant. That is, the Lipschitz continuity condition is applied to the generator such that the variation of the function (i.e., the output of the generator) is upper bounded by the variation of the inputs to the generator. By applying the Lipschitz continuity condition, the variation of the pictures can be well controlled; that is, the variation of the function G can be well controlled.

In the case of supervised learning (i.e., when desired target Y corresponding to an input Z to the generator is known), G(z) is expected to be (e.g., desired to be) close to the target Y. The difference between the generator G(Z) and the target Y can be required to be upper bounded by the latent space difference.

Directly bounding the difference of the output of the generator (i.e., |G(z₁)−G(z₂)|) by the difference of the inputs (i.e., |z₁−z₂|) is not valid because the inputs (e.g., z₁ and z₂) are usually random and/or corrupted by random noise or other impairments.

An additional encoding map E (i.e., an encoder E) can be explicitly added. The encoding map E can map the ambient space to a new latent space. The Lipschitz condition can be applied to both the generator G and the encoder E, as further described below. The Lipschitz condition is expressed by the inequality (4). |Y−G(Z)|≤k*|E(Y)−E(G(Z))|  (4)

In the inequality (4), Y is a real data sample and G(Z) is the output of the generator corresponding to Y. That is, given input Z, the generator is expected to output a G(Z) that is as close as possible to Y. E(Y) and E(G(Z)) are the latent space points mapped from the ambient space by the encoder E. Inequality (4) can stated as: Given a target sample Y, then it is desirable to make the difference between Y and the generated data, G(Z), be upper bounded by latent space variables. It is noted that the absolute differences used herein (such as |Y−G(Z)|), |E(Y)−E(G(Z))|, etc.) mean the Li-norms, unless otherwise stated. However, this disclosure is not so limited and, as such, another norm or other error measurements can be used. For example, the error can be the mean squared error.

To reiterate, based on the inequality (4), Y can be approximated by G(Z) more closely, if the E(Y) and the E(G(Z)) are themselves close enough. A reason for using the inequality (4) instead of the inequality (3) is that as Z is known to generally be noisy, Z may contain distortion and/or other artefacts. Directly bounding the difference of the generator function, G, by a noisy input difference is not a good idea.

The encoder E maps an original (e.g., target) sample (e.g., image), Y, and/or the generated data (e.g., image), G(Z), which are in the high dimension of the ambient space, into another low dimension space, the latent space. Such mapping is denoted as E(Y), for Y, and E(G(z)), for G(Z).

As described with respect to FIG. 1 , a typical GAN architecture includes only a generator and a discriminator. As such, the typical GAN architecture does not include an encoder E, as described above.

FIG. 5 is an example of a GAN architecture 500 that includes an encoder according to implementations of this disclosure. The GAN architecture 500 includes a generator 502, a discriminator 504, and an encoder 506. The generator 502 can be as described with respect to the generator 102 of FIG. 1 , with the exception that the objective function of the generator 502 is different from that of the generator 102 as described herein. The discriminator 504 can be as described with respect to the discriminator 104 of FIG. 1 . The encoder 506 can be a neural network, such as a convolutional neural network. For example, the encoder 506 can be adapted from the first few layers of a typical VGG model such as the VGG16, and/or followed by a few upscaling layers so that the output of the encoder 506 can match the size of noisy sample Z (i.e., the input to the generator 502). VGG and VGG16 are named after the Visual Geometry Group at Oxford University and are described in Karen Simonyan, Andrew Zisserman (2015), VERY DEEP CONVOLUTIONAL NETWORKS FOR LARGE-SCALE IMAGE RECOGNITION. ICLR 2015. Retrieved from https://arxiv.org/pdf/1409.1556.pdf %20http://arxiv.org/abs/1409.1556.pdf and is incorporated herein in its entirety. The encoder 506 can be implemented by or executed by a computing device (i.e., an apparatus), such as the computing device 200 of FIG. 2 .

As described above with respect to FIG. 1 , the generator 502 can receive as input an input Z and output a generated sample G(Z). The input Z can be a random value that is sampled from a distribution (such as a uniform distribution), p(z). The input Z can include multiple components. That is, the input Z can be a multi-dimensional (e.g., a J-dimensional) vector of random values. Via training, the generator learns a mapping from the random noise Z to the ambient space G(Z). As such, G(Z) is the ambient space representation of the random input Z.

The discriminator 504 can receive either the generated sample G(Z) along a path 508 or receive, along a path 516, a target Y corresponding to G(Z). When the discriminator 504 receives G(Z), the discriminator 504 outputs a value D(G(Z)) indicating whether the discriminator 504 determined the G(Z) to be real or generated. When the discriminator 504 receives Y, the discriminator 504 outputs a value D(Y) indicating whether the discriminator 504 determined the input Y to be real or generated.

The encoder 506 also receives as input the target Y, along a path 514, and the generated sample, G(Z), along a path 510. When the encoder 506 receives G(Z), the encoder 506 outputs a value E(G(Z)). When the encoder 506 receive Y, the encoder 506 outputs a value E(Y).

The encoder 506 can be thought of as encoding the salient (e.g., important) features of an original image and those of a corresponding, generated image, into a usually smaller space of the features, and minimizing the difference between those two encodings while applying the inequality (4), which is reflected, as further described below and as illustrated by a dashed line 518, in the optimization of the of the GAN model that includes the encoder 506.

Accordingly, the generator 502 optimization problem of equation (2) can be reformulated (i.e., restated) as equation (5)—that is, the optimization problem of equation (2) has to satisfy the Lipschitz continuity condition with respect to the encoding map (i.e., the encoder 506).

$\begin{matrix} \left\{ \begin{matrix} {\theta_{G}^{*} = {\arg_{\theta_{G}}\min_{\theta_{G}}E{P_{Z}\left\lbrack {\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}(z)} \right)}} \right)} \right\rbrack}}} \\ {{{subject}\ {to}\ {❘{Y - {G_{\theta_{G}}(Z)}}❘}} \leq {k*{❘{{E_{\theta_{E}}(Y)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}(Z)} \right)}}❘}}} \end{matrix} \right. & (5) \end{matrix}$

In equation (5), k is a constant and θ_(G) is the current set of weights of the generator 502 network; θ_(E) is the current set of weights of the encoder 506 network; and EP_(z) represents the expectation with respect to the distribution of the noisy input sample Z. θ_(G)* is the new set of weights of the generator network resulting from the optimization problem of equation (2).

Mathematically, the equation (5) can be re-written as equation (6) (since a solution for the equation (5) must be a solution for the equation (6)), in which the Lipschitz constrain is added as a term to (i.e., incorporated into) the generator objective function (i.e., equation (2)):

$\begin{matrix} {\theta_{G}^{*} = {\arg\limits_{\theta_{G}}\min\limits_{\theta_{G}}{{EP}_{Z}\begin{bmatrix} {{\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}(Z)} \right)}} \right)} +} \\ {\mu\left( {{❘{Y - {G_{\theta_{G}}(Z)}}❘} - {k*{❘{{E_{\theta_{E}}(Y)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}(Z)} \right)}}❘}}} \right)} \end{bmatrix}}}} & (6) \end{matrix}$

The equation (6) can be converted to equation (7) by introducing hyperparameters μ₁ and μ₂, where μ₁>0 and μ₂>0. The hyperparameter μ₁ can be the same as the parameter μ of equation (6); and the hyperparameter μ₂ can be equal to μ*k. The hyperparameters μ₁ and μ₂ can be set using heuristics and/or can be derived empirically.

$\begin{matrix} {\theta_{G}^{*} = {\arg\limits_{\theta_{G}}\min\limits_{\theta_{G}}{{EP}_{Z}\begin{bmatrix} {{\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}(Z)} \right)}} \right)} +} \\ {{\mu_{1}*{❘{Y - {G_{\theta_{G}}(Z)}}❘}} - {\mu_{2}*{❘{{E_{\theta_{E}}(Y)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}(Z)} \right)}}❘}}} \end{bmatrix}}}} & (7) \end{matrix}$

As already mentioned above, the outputs E(G(Z)) and E(Y) of the encoder 506 are used by the generator 502 as part of the loss function of the generator 502, as shown in equation (7) and as illustrated by the dashed line 518. As also already mentioned, the encoder 506 is trained to minimize the absolute difference between E(G(Z)) and E(Y).

The GAN 500 model can be formulated by the below equations (8)-(10). During training, the discriminator 504, the generator 502, and the encoder 506 are trained alternately. The discriminator 504 can be trained to maximize the function in (8), as in the GAN 100 of FIG. 1 . The generator 502 and the encoder 506 are trained to minimize the loss functions in (9) and (10), respectively. Note that equation (8) is the same as equation (1) and equation (9) is the same as equation (7). As illustrated by equation (10), the encoder 506 optimizes the difference between E(Y) (i.e., the latent space presentation of the real sample) and E(G(Z)) (i.e., the latent space representation of the generated, by the generator 502, sample).

$\begin{matrix} {\theta_{D}^{*} = {{\arg_{\theta_{D}}\max_{\theta_{D}}E{P_{y}\left\lbrack {\log{D_{\theta_{D}}(y)}} \right\rbrack}} + {E{P_{Z}\left\lbrack {\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}(z)} \right)}} \right)} \right\rbrack}}}} & (8) \end{matrix}$ $\begin{matrix} {\theta_{G}^{*} = {\arg\limits_{\theta_{G}}\min\limits_{\theta_{G}}{{EP}_{Z}\begin{bmatrix} {{\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}(z)} \right)}} \right)} +} \\ {{\mu_{1}*{❘{Y - {G_{\theta_{G}}(Z)}}❘}} - {\mu_{2}*{❘{{E_{\theta_{E}}(Y)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}(Z)} \right)}}❘}}} \end{bmatrix}}}} & (9) \end{matrix}$ $\begin{matrix} {\theta_{E}^{*} = {\arg\limits_{\theta_{E}}\min\limits_{\theta_{E}}{{EP}_{Z}\left\lbrack {❘{{E_{\theta_{E}}(Y)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}(Z)} \right)}}❘} \right\rbrack}}} & (10) \end{matrix}$

Using the set of weights θ_(E) of the encoder 506, when G(Z) is fed (i.e., input) into the encoder 506, the encoder 506 outputs E(G(Z)). Using the same set of weights θ_(E), when Y is fed (i.e., input) into the encoder 506, the encoder 506 outputs E(Y). That is, the same set of weights are used for generating E(G(Z)) and E(Y). In some implementations, where parallel processors may be available, G(Z) and Y may be input into the encoder 506 to output E(G(Z)) and E(Y). Again, G(Z) is the generated sample that corresponds to the sample Y. That is, G(Z) is expected to look a lot like Y.

Feeding both G(Z) and Y to the encoder 506 can constitute one iteration. The weights of the encoder 506 are not updated within one iteration. The weights are updated after one or more complete iterations.

While the proposed constraints of equations (4) and (5) are described with respect to a particular generator objective function (e.g., equation (2)) and a particular discriminator objective function (e.g., equation (1)), the disclosure herein is not so limited. The constraints in equations (4) or (5) can be applicable when other forms of the discriminator function and the generator adversarial function other than the ones in equations (1) and (2) are used. For example, equation (4) can be used along with the Wasserstein distance, the Relativistic discriminator, or some other objective functions, which are used instead of equations (1) and (2). The Wasserstein distance is described in Arjovsky, M., Chintala, S. & Bottou, L. (2017). Wasserstein Generative Adversarial Networks. Proceedings of the 34th International Conference on Machine Learning, in PMLR 70:214-223. The Relativistic discriminator is described in Jolicoeur-Martineau, A.: The relativistic discriminator: a key element missing from standard gan. arXiv preprint arXiv:1807.00734 (2018). As can be appreciated, the equations (8)-(10) are be updated depending on the objective functions used.

The pseudocode of Table I illustrates an example of a training algorithm of GANs that include an encoder, such as the GAN 500 of FIG. 5 .

TABLE I 0 Network weight parameters θ_(D) , θ_(E) and θ_(G) are first randomly initialized. 1 For N training iterations do 2  For L steps do 3    Sample mini-batch of m noise samples {z ₁, . . . , Z_(m)} from    noise prior p_(g)(z).    The corresponding in target samples are {y₁, . . . , y_(m)}. 4    Update the discriminator D by ascending its stochastic    gradient:     ${\nabla_{\theta_{D}}\frac{1}{m}}{\sum_{i = 1}^{m}\left\lbrack {{\log\left( {D_{\theta_{D}}\left( y_{i} \right)} \right)} + {\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}} \right.}} \right\rbrack}$ 5  End for 6  Sample mini-batch of m noise samples {z ₁, . . . , Z_(m)} from noise  prior p_(g)(z).  The corresponding in target samples are {y₁, . . . , y_(m)}. 7  Update the generator G by descending its stochastic gradient:   ${\nabla_{\theta_{G}}\frac{1}{m}}{\sum_{i = 1}^{m}\left\lbrack \text{⁠}{{{\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}} \right)} + {\left. {\mu_{1}*} \middle| {y_{i} - {G_{\theta_{G}}\left( z_{i} \right)}} \middle| {{- \mu_{2}^{*}}{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}} \right.}}} \right\rbrack}$ 8   Update the encoder E by descending its stochastic gradient:    $\left. {{\nabla_{\theta_{E}}\frac{1}{m}}\sum_{i = 1}^{m}} \middle| {{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}} \right.❘$ 9 End For

Table I illustrates that the GAN model can be trained using N iterations. Each of the discriminator network (i.e., the discriminator 504 of FIG. 5 ), the generator network (i.e., the generator 502 of FIG. 5 ), and the encoder network (i.e., the encoder 506 of FIG. 5 ) are trained, in that order, in one iteration. That is, one iteration involves the training of the three networks: the discriminator, the generator, and the encoder. As an initialization step (i.e., row 0 of Table I), the weights θ_(D), θ_(E) and θ_(G) of, respectively, the discriminator, the encoder, and the generator networks are initialized to random values.

A first Loop of L steps (consisting of rows 2-5 in Table I) describes the training of the discriminator network. In some implementations, L is 1. In other implementations, L can be larger than 1. As such, the discriminator network can be optimized 1 or more times, depending on the value of L.

In each iteration, at row 3 of Table I, a mini-batch of m noisy sample {z₁, . . . , z_(m)}, can be selected using the noisy data-generating distribution p_(g)(z). As supervised learning is described herein, there are corresponding m target samples, corresponding to each of the input samples. That is, for the input z_(i) there is a desired output of y_(i). Next, at row 4 of Table I, the discriminator weights, θ_(D), are updated by the gradient ascent (since, as shown in equation (8), updating the discriminator weights is a maximization optimization problem). The details of gradient ascent (and descent) are not described herein as their details are known to a person skilled in the art and an understanding thereof is not necessary to the understanding of this disclosure. As is known, ascending (or descending) a stochastic gradient (as described with respect to Table I and elsewhere in this disclosure) means ascending (or descending) at least a portion of the gradient. Usually, a portion of the gradient is used for the ascending (or descending).

After the L steps of training the discriminator, the algorithm of Table I proceeds to update the generator and the encoder networks. At row 6 of Table I, another mini_batch (i.e., a set) of noise samples {z₁, . . . , z_(m)} that are sampled using the noisy data-generating distribution p_(g)(z), and the corresponding desired targets {y₁, . . . , y_(m)} are selected. Again, as supervised learning is described herein, each z_(i) corresponds to a y_(i).

At row 7 of Table I, the generator parameters, θ_(G), are updated using by the right hand side of equation (9). That is, the updated parameters can be obtained by descending the stochastic gradient of the right hand side of equation (9). Simultaneously, or subsequently, at row 8 of Table I, the encoder parameters, θ_(E), are updated by descending its gradient, which is calculated based on the right hand side equation (10).

The above described process completes one iteration of updating the respective parameters of the for discriminator, generator, and encoder networks. The process can be repeated N times, where N can be a sufficiently large enough number so that the GAN network converges. N can also be set empirically. In an example, the algorithm may not execute N times; rather the algorithm may include a termination condition that terminates the algorithm when it is determined that performance of the GAN network is no longer improving sufficiently. In an example, the discriminator can be trained after the encoder and the generator. As such, the rows 2-5 can be after the rows 6-9 in Table I.

FIG. 6 is an example of a flowchart of a technique 600 of training a Generative Adversarial Network (GAN) according to implementations of this disclosure. The GAN can be the GAN 500 of FIG. 5 . As such, the generator G can be the generator 502 of FIG. 5 ; and the GAN can include a discriminator D, such as the discriminator 504 of FIG. 5 and an encoder E, such as the encoder 506 of FIG. 5 . The technique 600 can be implemented by a computing device (i.e., an apparatus), such as the computing device 200 of FIG. 2 . Upon completion of the technique 600, the parameters of the generator G may be stored. The parameters can be stored in a memory, such in the memory 204 of FIG. 2 . The parameters of the generator G can include the networks weights of the generator G. The parameters can also include the generator network architecture, such as the number of layers, the configuration of each layer, and the like.

The technique 600 can be performed partially or fully by one or more processors, such as the CPU 202 of FIG. 2 . The technique 600 can be stored as executable instructions in one or more memories, such as the memory 204 or the secondary storage 214 of FIG. 2 . The one or more processors can be configured to execute the instructions stored in the one or more memories.

In an example, the generator G, the encoder E, and the discriminator D can be available on (e.g., executing on) one or more computing devices, such as the computing device 200 of FIG. 2 . In an example, each of the generator G, the encoder E, and the discriminator D can be available on a separate computing device. However, that need not be the case.

At 602, the encoder E can receive a target data, Y. The target data Y can be a real data sample. For example, the target data Y can be a real image. The encoder E can generate a first latent space representation, E(Y), of Y, as described above.

At 604, the encoder E can receive an output G(Z) of G. As described above, G(Z) is synthetic data that are generated by the generator G given a noisy sample Z having a data-generating distribution p_(g)(z). As mentioned above, the target data Y corresponds to the output G(Z). The encoder E can generate a second latent space representation, E(G(Z)), of G(Z), as described above. As also described above, the discriminator D is trained to distinguish which of the G(Z) and the target data Y is generated and/or real data.

At 606, the technique 600 trains the encoder E to minimize a difference between a first latent space representation (i.e., first latent space features) E(G(Z)) of the output G(Z) and a second latent space representation (i.e., second latent space features) E(Y) of the target data Y, where the output G(Z) and the target data Y are input to the encoder E.

At 608, the technique 600 uses the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G, as described above.

As described above with respect to Table I, the technique 600 can include updating the encoder E by descending, for m samples, a gradient

${\nabla_{\theta_{E}}\frac{1}{m}}{\sum_{i = 1}^{m}{{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}.}}$

As described above, using the latent spaces E(G(Z)) and E(Y) to constrain the training of the generator G can include updating the generator G by descending, for m samples, a gradient

${\nabla_{\theta_{G}}\frac{1}{m}}{\sum_{i = 1}^{m}{\left\lbrack {{\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}} \right)} + \text{ }{\mu_{1}*{❘{y_{i} - {G_{\theta_{G}}\left( z_{i} \right)}}❘}} - {\mu_{2}*{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}}} \right\rbrack.}}$ Parameters μ₁ and μ₂ are hyperparameters, as described above.

When the training is completed, the discriminator D is no longer able to distinguish a real data sample (a real image) from a generated (e.g., synthetic, generated) sample. If the discriminator is still able to distinguish real from fake, it means that the training is not optimized and the training cannot be considered completed. As already mentioned, the principle of the GAN model is that the generator tries to confuse the discriminator; and the discriminator tries to not be confused. Thus, the process is “adversarial.” However, eventually, when the generator G does a good enough job of data generation, the discriminator D will no longer be able to tell which first input data (e.g., a first image) is real and which second input data (e.g., a second image) is fake.

In an example, the encoder E can be or can include a VGG network. In an example, the VGG network can be adapted or can include one or more upscaling layers. The purpose of the one or more upscaling layers is so that the output of the encoder E can have the same dimensionality as the noisy sample Z. More generally, the encoder E can be, or can include, other neural network types, such as a convolutional neural network. In other examples, the encoder E can be, or can implement, other machine learning models or techniques.

As described above, for example with respect to equations (5)-(7) and (9), the generator G can be trained by applying a Lipschitz condition so as to upper bound a first difference between the output G(Z) and the target data Y to a second difference between the first latent space representation E(G(Z)) and the second latent space representation E(Y).

It is also to be noted that, typically, when the GAN network is trained, it is the generator that is subsequently used to generate data and/or to perform inferences or any other task for which the generator is trained. Typically, the encoder and the discriminator are not used for purposes other than in the training of the generator.

As mentioned, the techniques described herein can be used in supervised training. Supervised training may be used for applications such as image super resolution and inpainting. For example, in the case of image super resolution, the input sample Z to the generator, during training, can be, or can be thought of, as a low resolution image and the output G(Z) can be or can be thought of as a corresponding high resolution image. As such, the input sample Z can have the same size as that of a low resolution image. In another example, the input sample Z can correspond to a feature vector of features extracted from a low resolution image.

Another aspect of the disclosed implementations is a method for generating a super resolution image. The method can include receiving, by a generator G, an input corresponding to a low resolution image and outputting, from the generator G, a super resolution image corresponding to the low resolution image. In an example, the input can be the low resolution image itself. In another example, the input can be a vector of features extracted from the low resolution image.

The generator can be trained using a Generative Adversarial Network (GAN) as described above. As such, the GAN can include the generator G, an encoder E, and a discriminator D. As described above, the outputs of the encoder E can be used to constrain the training of the generator G. The outputs of the encoder can include a first latent space representation E(G(Z)) of an output G(Z) of the generator G, where Z corresponds to a training low-resolution image and G(Z) corresponds to a generated high-resolution image; and a second latent space representation E(Y) of a training high-resolution image Y. The encoder can be trained to minimize a difference between the first latent space representation E(G(Z)) and the second latent space representation E(Y). The encoder can be trained by descending, for in samples, a gradient

${{\nabla_{\theta_{E}}\frac{1}{m}}{\sum_{i = 1}^{m}{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}}},$ as described above. The generator G can be trained by applying a Lipschitz condition so as to upper bound a first difference between the generated high-resolution image and the training high-resolution image Y to a second difference between by the first latent space representation E(G(Z)) and the second latent space representation E(Y). In an implementation, and as also mentioned above, the encoder E can be, or can include, a VGG network. However, other neural networks, such as a convolutional neural networks, or other machine learning models are possible.

For simplicity of explanation, the technique 600 of FIG. 6 is depicted and described as a series of steps. However, steps in accordance with this disclosure can occur in various orders, concurrently, and/or iteratively. Additionally, steps in accordance with this disclosure may occur with other steps not presented and described herein. Furthermore, not all illustrated steps may be required to implement a technique in accordance with the disclosed subject matter.

The implementations herein may be described in terms of functional block components and various processing steps. The disclosed processes and sequences may be performed alone or in any combination. Functional blocks may be realized by any number of hardware and/or software components that perform the specified functions. For example, the described implementations may employ various integrated circuit components, e.g., memory elements, processing elements, logic elements, look-up tables, and the like, which may carry out a variety of functions under the control of one or more microprocessors or other control devices. Similarly, where the elements of the described implementations are implemented using software programming or software elements the disclosure may be implemented with any programming or scripting language such as C, C++, Java, assembler, or the like, with the various algorithms being implemented with any combination of data structures, objects, processes, routines or other programming elements. Functional aspects may be implemented in algorithms that execute on one or more processors. Furthermore, the implementations of the disclosure could employ any number of conventional techniques for electronics configuration, signal processing and/or control, data processing and the like.

Aspects or portions of aspects of the above disclosure can take the form of a computer program product accessible from, for example, a computer-usable or computer-readable medium. A computer-usable or computer-readable medium can be any device that can, for example, tangibly contain, store, communicate, or transport a program or data structure for use by or in connection with any processor. The medium can be, for example, an electronic, magnetic, optical, electromagnetic, or a semiconductor device. Other suitable mediums are also available. Such computer-usable or computer-readable media can be referred to as non-transitory memory or media, and may include RAM or other volatile memory or storage devices that may change over time. A memory of an apparatus described herein, unless otherwise specified, does not have to be physically contained by the apparatus, but is one that can be accessed remotely by the apparatus, and does not have to be contiguous with other memory that might be physically contained by the apparatus.

The word “example” is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as “example” is not necessarily to be construed as preferred or advantageous over other aspects or designs. Rather, use of the word “example” is intended to present concepts in a concrete fashion. As used in this application, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from context, “X includes A or B” is intended to mean any of the natural inclusive permutations. In other words, if X includes A; X includes B; or X includes both A and B, then “X includes A or B” is satisfied under any of the foregoing instances. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form. Moreover, use of the term “an aspect” or “one aspect” throughout is not intended to mean the same implementation or aspect unless described as such.

The particular aspects shown and described herein are illustrative examples of the disclosure and are not intended to otherwise limit the scope of the disclosure in any way. For the sake of brevity, conventional electronics, control systems, software development and other functional aspects of the systems (and components of the individual operating components of the systems) may not be described in detail. Furthermore, the connecting lines, or connectors shown in the various figures presented are intended to represent exemplary functional relationships and/or physical or logical couplings between the various elements. Many alternative or additional functional relationships, physical connections or logical connections may be present in a practical device.

The use of “including” or “having” and variations thereof herein is meant to encompass the items listed thereafter and equivalents thereof as well as additional items. Unless specified or limited otherwise, the terms “mounted,” “connected,” ‘supported,” and “coupled” and variations thereof are used broadly and encompass both direct and indirect mountings, connections, supports, and couplings. Further, “connected” and “coupled” are not restricted to physical or mechanical connections or couplings.

The use of the terms “a” and “an” and “the” and similar referents in the context of describing the disclosure (especially in the context of the following claims) should be construed to cover both the singular and the plural. Furthermore, recitation of ranges of values herein are merely intended to serve as a shorthand method of referring individually to each separate value falling within the range, unless otherwise indicated herein, and each separate value is incorporated into the specification as if it were individually recited herein. Finally, the steps of all methods described herein are performable in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The use of any and all examples, or exemplary language (e.g., “such as”) provided herein, is intended merely to better illuminate the disclosure and does not pose a limitation on the scope of the disclosure unless otherwise claimed.

The above-described implementations have been described in order to allow easy understanding of the present disclosure and do not limit the present disclosure. To the contrary, the disclosure is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims, which scope is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structure as is permitted under the law.

While the disclosure has been described in connection with certain embodiments, it is to be understood that the disclosure is not to be limited to the disclosed embodiments but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims, which scope is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structures as is permitted under the law. 

What is claimed is:
 1. A method of training a generator G of a Generative Adversarial Network (GAN), comprising: receiving, by an encoder E, a target data Y; receiving, by the encoder E, an output G(Z) of the generator G, wherein the generator G generates the output G(Z) in response to receiving a random sample Z, and wherein a discriminator D of the GAN is trained to distinguish between the output G(Z) and the target data Y; training the encoder E to minimize a difference between a first latent space representation E(G(Z)) of the output G(Z) and a second latent space representation E(Y) of the target data Y, wherein the output G(Z) and the target data Y are input to the encoder E; and using the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G.
 2. The method of claim 1, further comprising: updating the encoder E by descending, for m samples, a gradient ${{\nabla_{\theta_{E}}\frac{1}{m}}{\sum_{i = 1}^{m}{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}}},$ wherein them samples comprising m noise samples {z₁, z₂, . . . , z_(m)} selected from a distribution p(z) and m corresponding target data {y₁, y₂, . . . , y_(m)}, wherein E_(θ) _(E) (y_(i)) is a first output of the encoder E given first current weight values θ_(E) of the encoder E and a first input y_(i), wherein G_(θ) _(G) (z_(i)) is a second output of the of the generator G given second current weight values θ_(G) of the generator G and a second input z_(i), and wherein E_(θ) _(E) (G_(θ) _(G) (z_(i))) is a third output of the of the encoder E given the first current weight values θ_(E) of the encoder E and G_(θ) _(G) (z_(i)) as input.
 3. The method of claim 1, wherein the target data Y corresponds to the output G(Z).
 4. The method of claim 1, wherein the generator G is trained by applying a Lipschitz condition so as to upper bound a first difference between the output G(Z) and the target data Y to a second difference between the first latent space representation E(G(Z)) and the second latent space representation E(Y).
 5. The method of claim 1, wherein the encoder E is a neural network comprising an upscaling layer, and wherein each of the outputs E(G(Z)) and E(Y) of the encoder E having a first size equal to a second size of Z.
 6. The method of claim 1, wherein the random sample Z is a multi-dimensional vector of values selected from a distribution p(z).
 7. The method of claim 1, wherein using the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G, comprising: updating the generator G by descending, for m samples, a gradient ${{\nabla_{\theta_{E}}\frac{1}{m}}{\sum_{i = 1}^{m}\left\lbrack {{\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}} \right)} + \text{ }{\mu_{1}*{❘{y_{i} - {G_{\theta_{G}}\left( z_{i} \right)}}❘}} - {\mu_{2}*{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}}} \right\rbrack}},$ wherein θ_(D), θ_(G), and θ_(E) are, respectively, weights of the discriminator D, the generator G, and the encoder E, wherein G_(θ) _(G) (z_(i)) is an output of the generator G for an input z_(i), wherein D_(θ) _(D) , (G_(θ) _(G) (z_(i))) and E_(θ) _(E) (G_(θ) _(G) (z_(i))) are, respectively, outputs of the discriminator D and the encoder E when G_(θ) _(G) (z_(i)) is used as input, wherein E_(θ) _(E) (y_(i)) is an encoder E output for a target datum y_(i), and wherein μ₁ and μ₂ are hyperparameters.
 8. An apparatus for training a generator G of a Generative Adversarial Network (GAN), comprising: a memory; and a processor, the processor is configured to execute instructions stored in the memory to: input, to an encoder E, a target data Y; input, to the encoder E, an output G(Z) of the generator G, wherein the generator G generates the output G(Z) in response to receiving a random sample Z, and wherein a discriminator D of the GAN is trained to distinguish between the output G(Z) and the target data Y; train the encoder E to minimize a difference between a first latent space representation E(G(Z)) of the output G(Z) and a second latent space representation E(Y) of the target data Y, wherein the output G(Z) and the target data Y are input to the encoder E; and use the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G.
 9. The apparatus of claim 8, wherein the instructions further comprise instructions to: update the encoder E by descending, for m samples, a gradient ${{\nabla_{\theta_{E}}\frac{1}{m}}{\sum_{i = 1}^{m}{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}}},$ wherein the m samples comprise m noise samples {z₁, z₂, . . . , z_(m)} selected from a distribution p(z) and m corresponding target data {y₁, y₂, . . . , y_(m)}, wherein E_(θ) _(E) (y_(i)) is a first output of the encoder E given first current weight values θ_(E) of the encoder E and a first input y_(i), wherein G_(θ) _(G) (z_(i)) is a second output of the of the generator G given second current weight values θ_(G) of the generator G and a second input z_(i), and wherein E_(θ) _(E) (G_(θ) _(G) (z_(i))) is a third output of the of the encoder E given the first current weight values θ_(E) of the encoder E and G_(θ) _(G) (z_(i)) as input.
 10. The apparatus of claim 8, wherein the target data Y corresponds to the output G(Z).
 11. The apparatus of claim 8, wherein the encoder E comprises a neural network.
 12. The apparatus of claim 11, wherein the encoder E further comprises an upscaling layer, and wherein each of the outputs E(G(Z)) and E(Y) of the encoder E having a first size equal to a second size of Z.
 13. The apparatus of claim 8, wherein the random sample Z is a multi-dimensional vector of values selected from a distribution p(z).
 14. The apparatus of claim 8, wherein to use the first latent space representation E(G(Z)) and the second latent space representation E(Y) to constrain the training of the generator G, comprises to: updating the generator G by descending, for m samples, a gradient ${\nabla_{\theta_{E}}\frac{1}{m}}{\sum_{i = 1}^{m}{\left\lbrack {{\log\left( {1 - {D_{\theta_{D}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}} \right)} + \text{ }{\mu_{1}*{❘{y_{i} - {G_{\theta_{G}}\left( z_{i} \right)}}❘}} - {\mu_{2}*{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}}} \right\rbrack.}}$
 15. An apparatus for generating a super resolution image, comprising: a memory; and a processor, the processor is configured to execute instructions stored in the memory to: receive, by a generator G, an input corresponding to a low resolution image; and output, from the generator G, a super resolution image corresponding to the low resolution image, wherein the generator G is trained using a Generative Adversarial Network (GAN), the GAN comprising: the generator G; an encoder E; and a discriminator D, wherein outputs of the encoder E are used to constrain the training of the generator G, wherein the outputs of the encoder comprise: a first latent space representation E(G(Z)) of an output G(Z) of the generator G, wherein Z corresponds to a training low-resolution image and G(Z) corresponds to a generated high-resolution image; and a second latent space representation E(Y) of a training high-resolution image Y.
 16. The apparatus of claim 15, wherein the encoder E is trained to minimize a difference between the first latent space representation E(G(Z)) and the second latent space representation E(Y).
 17. The apparatus of claim 16, wherein the encoder E is trained by descending, for m samples, a gradient ${\nabla_{\theta_{E}}\frac{1}{m}}{\sum_{i = 1}^{m}{{❘{{E_{\theta_{E}}\left( y_{i} \right)} - {E_{\theta_{E}}\left( {G_{\theta_{G}}\left( z_{i} \right)} \right)}}❘}.}}$
 18. The apparatus of claim 16, wherein the generator G is trained by applying a Lipschitz condition so as to upper bound a first difference between the generated high-resolution image and the training high-resolution image Y to a second difference between the first latent space representation E(G(Z)) and the second latent space representation E(Y).
 19. The apparatus of claim 15, wherein the encoder E comprises a VGG network. 